Exact and Ordinary Lumpability in Finite Markov Chainsy
نویسنده
چکیده
Exact and ordinary lumpability in nite Markov chains is considered. Both concepts naturally deene an aggregation of the Markov chain yielding an aggregated chain that allows the exact determination of several stationary and transient results for the original chain. We show which quantities can be determined without an error from the aggregated process and describe methods to calculate bounds on the remaining results. Furthermore, the concept of lumpability is extended to nearly lumpability yielding approximative aggregation.
منابع مشابه
On Relational Properties of Lumpability
The technique of lumping of Markov chains is one of the main tools for recovering from state explosion in the quantitative analysis of large probabilistic systems. Useful results regarding relational properties of general, ordinary and exact lumpability, in particular transitivity and strict confluence, are rather scattered or implicit in the literature. These are collected and reformulated her...
متن کاملA geometric invariant in weak lumpability of finite Markov chains
We consider weak lumpability of finite homogeneous Markov chains, that is when a lumped Markov chain with respect to a partition of the initial state space is also a homogeneous Markov chain. We show that weak lumpability is equivalent to the existence of a direct sum of polyhedral cones which is is positively invariant by the transition probability matrix of the original chain. It allows us, i...
متن کاملTowards State Space Reduction Based on T-Lumpability-Consistent Relations
Markovian behavioral equivalences can be exploited for state space reduction before performance evaluation takes place. It is known that Markovian bisimilarity corresponds to ordinary lumpability and that Markovian testing and trace equivalences correspond to a coarser exact relation we call T-lumpability. While there exists an ordinarylumpability-consistent aggregation algorithm, this is not t...
متن کاملLumpable hidden Markov models-model reduction and reduced complexity filtering
This paper is concerned with filtering of hidden Markov processes (HMPs) which possess (or approximately possess) the property of lumpability. This property is a generalization of the property of lumpability of a Markov chain which has been previously addressed by others. In essence, the property of lumpability means that there is a partition of the (atomic) states of the Markov chain into aggr...
متن کاملWeighted Lumpability on Markov Chains
This paper reconsiders Bernardo’s T-lumpability on continuous-time Markov chains (CTMCs). This notion allows for a more aggressive state-level aggregation than ordinary lumpability. We provide a novel structural definition of (what we refer to as) weighted lumpability, prove some elementary properties, and investigate its compatibility with linear real-time objectives. The main result is that t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994